Dynamic Slicing of Concurrent Programs : Where are We and Where is the Right Way ? ( Extended
نویسنده
چکیده
Program slicing has been developed as a standard technique used in various software engineering activit ies including program understanding, testing, debugging, maintenance, and complexity measurement. Although both static and dynamic slicing of sequential programs have been applied to software engineering practices, there still are some challenges, problems and issues in slicing concurrent programs, in particular, dynamic slicing of concurrent programs. This paper presents a methodological review for dynamic slicing of concurrent programs from the viewpoint of wholeness, uncertainty and self-measurement principles of concurrent systems. The paper proposes that we should develop a dependence / influence analysis method based on self-measurement principle to filter dynamic slices of concurrent programs.
منابع مشابه
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs∗ (Extended Version)
The problem of efficiently calculating precise slices of concurrent programs is challenging because it is difficult to statically reason about the dependences that arise when multiple threads perform interfering reads/writes on shared data. The use of heap-allocated data in such programs makes the task even more difficult due to problems associated with aliasing. Existing presentations of slici...
متن کاملPruning Interference and Ready Dependence for Slicing Concurrent Java Programs
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of interference dependence edges considered while slicing concurrent Java programs. The key idea is to statically detect situations where run-time heap objects are reachable from a single thread and use it to prune spurious in...
متن کاملAn Approach for Computing Dynamic Slice of Concurrent Aspect-Oriented Programs
We propose a dynamic slicing algorithm to compute the slice of concurrent aspect-oriented programs. We use a dependence based intermediate program representation called Concurrent Aspect-oriented System Dependence Graph (CASDG) to represent a concurrent aspect-oriented program. The CASDG of an aspect-oriented program consists of a system dependence graph (SDG) for the non-aspect code, a group o...
متن کاملBank branches efficiency assessment using dynamic data envelopment analysis approach to SBM
A new approach or model to the dynamic DEA, referred to as the adjusted dynamic DEA, is proposed in this study. Adjusted dynamic DEA optimizes the production activity of DMUs by introducing adjustment variables to modify the interconnecting activities between consecutive terms, solving conflicts that arise between terms and between management and shareholders. The non-oriented SBM model is used...
متن کاملExtended and infinite ordered weighted averaging and sum operators with numerical examples
This study discusses some variants of Ordered WeightedAveraging (OWA) operators and related information aggregation methods. Indetail, we define the Extended Ordered Weighted Sum (EOWS) operator and theExtended Ordered Weighted Averaging (EOWA) operator, which are applied inscientometrics evaluation where the preference is over finitely manyrepresentative works. As...
متن کامل